Boosting Automated Reasoning By Mining Existing Proofs
نویسنده
چکیده
Theorem provers are extremely useful tools for reasoning about complex mathematics and large scale systems. They play an important part in verifying the correctness of designs, particularly for safetycritical systems. The problem is that they still require a large amount of human intervention to successfully guide the proof. Our solution to this important limitation involves using data mining techniques to mine proof tactics from successful and unsuccessful proofs with the aim that they can be more widely applied. In this paper we motivate the problem, and describe our work in progress.
منابع مشابه
Automated and Human Proofs in General Mathematics: An Initial Comparison
First-order translations of large mathematical repositories allow discovery of new proofs by automated reasoning systems. Large amounts of available mathematical knowledge can be re-used by combined AI/ATP systems, possibly in unexpected ways. But automated systems can be also more easily misled by irrelevant knowledge in this setting, and finding deeper proofs is typically more difficult. Both...
متن کاملLearning Semantics for Automated Reasoning
Learning reasoning techniques from previous knowledge is a largely underdeveloped area of automated reasoning. As large bodies of formal knowledge are becoming available, state-of-the-art machine learning methods, particularly the ones that are able to leverage semantics from the mathematical libraries, provide a new avenue for problem-specific detection of relevant knowledge contained in the m...
متن کاملA Spectrum of Applications of Automated Reasoning
The likelihood of an automated reasoning program being of substantial assistance for a wide spectrum of applications rests with the nature of the options and parameters it offers on which to base needed strategies and methodologies. This article focuses on such a spectrum, featuring W. McCune’s program OTTER, discussing widely varied successes in answering open questions, and touching on some o...
متن کاملInterpolant Strength Revisited
Craig’s interpolation theorem has numerous applications in model checking, automated reasoning, and synthesis. There is a variety of interpolation systems which derive interpolants from refutation proofs; these systems are ad-hoc and rigid in the sense that they provide exactly one interpolant for a given proof. In previous work, we introduced a parametrised interpolation system which subsumes ...
متن کاملGenetic Reasoning: Evolutionary Induction of Mathematical Proofs
Most automated reasoning systems rely on human knowledge or heuristics to guide the reasoning or search for proofs. We have evaluated the use of a powerful general search algorithm to search in the space of mathematical proofs. In our approach, automated reasoning is seen as an instance of automated programming where the proof is seen as a program (of functions corresponding to rules of inferen...
متن کامل